Termination w.r.t. Q proof of TRS/higher-order/AotoYam020.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(times, app(s, x)), y) → APP(times, x)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(twice, f) → APP(comp, f)
APP(twice, f) → APP(app(comp, f), f)
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(app(comp, f), g), x) → APP(f, app(g, x))
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(times, app(s, x)), y) → APP(app(times, x), y)
APP(app(times, app(s, x)), y) → APP(app(plus, app(app(times, x), y)), y)
APP(app(times, app(s, x)), y) → APP(plus, app(app(times, x), y))
APP(app(app(comp, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(times, app(s, x)), y) → APP(times, x)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(twice, f) → APP(comp, f)
APP(twice, f) → APP(app(comp, f), f)
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(app(comp, f), g), x) → APP(f, app(g, x))
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(times, app(s, x)), y) → APP(app(times, x), y)
APP(app(times, app(s, x)), y) → APP(app(plus, app(app(times, x), y)), y)
APP(app(times, app(s, x)), y) → APP(plus, app(app(times, x), y))
APP(app(app(comp, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(times, app(s, x)), y) → APP(times, x)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(twice, f) → APP(app(comp, f), f)
APP(twice, f) → APP(comp, f)
APP(app(app(comp, f), g), x) → APP(f, app(g, x))
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(times, app(s, x)), y) → APP(app(plus, app(app(times, x), y)), y)
APP(app(times, app(s, x)), y) → APP(app(times, x), y)
APP(app(times, app(s, x)), y) → APP(plus, app(app(times, x), y))
APP(app(app(comp, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 7 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

PLUS(s(x), y) → PLUS(x, y)

R is empty.
The set Q consists of the following terms:

plus(0, x0)
plus(s(x0), x1)
times(0, x0)
times(s(x0), x1)
comp(x0, x1, x2)
twice(x0)

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = PLUS(x1)
s(x1) = s(x1)

Lexicographic path order with status [19].
Quasi-Precedence:

s₁ > PLUS₁

Status:

s₁: [1]
PLUS₁: [1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(times, app(s, x)), y) → APP(app(times, x), y)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

TIMES(s(x), y) → TIMES(x, y)

R is empty.
The set Q consists of the following terms:

plus(0, x0)
plus(s(x0), x1)
times(0, x0)
times(s(x0), x1)
comp(x0, x1, x2)
twice(x0)

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(times, app(s, x)), y) → APP(app(times, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
TIMES(x1, x2) = TIMES(x1)
s(x1) = s(x1)

Lexicographic path order with status [19].
Quasi-Precedence:

s₁ > TIMES₁

Status:

TIMES₁: [1]
s₁: [1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(comp, f), g), x) → APP(f, app(g, x))
APP(app(app(comp, f), g), x) → APP(g, x)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(app(comp, f), g), x) → APP(f, app(g, x))
APP(app(app(comp, f), g), x) → APP(g, x)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x1)
app(x1, x2) = app(x1, x2)
comp = comp
plus = plus
s = s
times = times
0 = 0
twice = twice

Lexicographic path order with status [19].
Quasi-Precedence:

APP₁ > [app₂, s]
plus > [app₂, s]
times > [app₂, s]
twice > comp > [app₂, s]

Status:

comp: multiset
APP₁: [1]
twice: multiset
app₂: [1,2]
plus: multiset
0: multiset
times: multiset
s: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(app(app(comp, f), g), x) → app(f, app(g, x))
app(twice, f) → app(app(comp, f), f)

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(app(times, 0), x0)
app(app(times, app(s, x0)), x1)
app(app(app(comp, x0), x1), x2)
app(twice, x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.